Watersheds on edge or node weighted graphs "par l'exemple"
نویسنده
چکیده
Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp. node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
منابع مشابه
Watersheds, waterfalls, on edge or node weighted graphs
Fernand MeyerCentre de Morphologie MathématiqueMines-ParisTech () Watersheds, waterfalls, on edge or node weighted graphs 2012 February 29 1 / 201 arXi Introduction The watershed transform is one of the major image segmentation tools [4], used in the community of mathematical morphology and beyond. If the watershed is a successful concept, there is another side of the coin: a number of definiti...
متن کاملConstructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
In edge-weighted graphs, we provide a unified presentation of a family of popular morphological hierarchies such as component trees, quasi flat zones, binary partition trees, and hierarchical watersheds. For any hierarchy of this family, we show if (and how) it can be obtained from any other element of the family. In this sense, the main contribution of this paper is the study of all constructi...
متن کاملNode-Weighted Network Design in Planar and Minor-Closed Families of Graphs
We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum node-weighted subgraph H of G such that, for each...
متن کاملWeighted fusion graphs: Merging properties and watersheds
This paper deals with mathematical properties of watersheds in weighted graphs linked to region merging methods, as used in image analysis. In a graph, a cleft (or a binary watershed) is a set of vertices that cannot be reduced, by point removal, without changing the number of regions (connected components) of its complement. To obtain a watershed adapted to morphological region merging, it has...
متن کاملOn Bipartite and Multipartite Clique Problems
In this paper, we introduce the maximum edge biclique problem in bipartite graphs and the edge/node weighted multipartite clique problem in multipartite graphs. Our motivation for studying these problems came from abstractions of real manufacturing problems in the computer industry and from formal concept analysis. We show that the weighted version and four variants of the unweighted version of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1303.1829 شماره
صفحات -
تاریخ انتشار 2013